The Fork Calculus
نویسندگان
چکیده
The Fork Calculus FC presents a theory of communicating systems in family with CCS, but it differs in the way that processes are put in parallel. In CCS there is a binary parallel operator |, and two processes p and q are put in parallel by p|q. In FC there is a unary fork operator, and a process p is activated to “run in parallel with the rest of the program” by fork(p). An operational semantics is defined, and a congruence relation between processes is suggested. In addition, a sound and complete axiomatisation of the congruence is provided. FC has been developed during an investigation of the programming language CML, an extension of ML with concurrency primitives, amongst them a fork operator.
منابع مشابه
Representability and Program Construction within Fork Algebras
The representation theorem for fork algebras was always misunderstood regarding its applications in program construction. Its application was always described as “the portability of properties of the problem domain into the abstract calculus of fork algebras”. In this paper we show that the results provided by the representation theorem are by far more important. We show that not only the heuri...
متن کاملPositive Fork Graph Calculus
We introduce and illustrate a graph calculus for proving and deciding the positive identities and inclusions of fork algebras, i.e., those without occurrences of complementation. We show that this graph calculus is sound, complete and decidable. Moreover, the playful nature of this calculus renders it much more intuitive than its equational counterpart.
متن کاملHow to say Greedy in Fork Algebras
Because of their expressive power, binary relations are widely used in program specification and development within formal calculi. The existence of a finite equational axiomatization for algebras of binary relations with a fork operation guarantees that the heuristic power coming from binary relations is captured inside an abstract equational calculus. In this paper we show how to express the ...
متن کاملAn Equational Calculus for Alloy
In this paper we show that, by translating Alloy formulas to formulas in the language of fork algebras, we obtain a complete, equational, and purely relational calculus for Alloy.
متن کاملDag-Calculus: A Calculus for Parallel Computation
This appendix consists of two main parts: in the first, we prove correct the translations of parallel primitives into the dag calculus, in the second, we prove that the scheduling algorithm implements the rules of the dag calculus. Concretely, Appendix A provides auxiliary definitions and properties for the translations; Appendices B, C and D provide the proofs of translations of fork-join, asy...
متن کامل